package Day2025_04_09;

import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public class Demo01 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        char[] s1 = sc.nextLine().toCharArray();
        char[] s2 = sc.nextLine().toCharArray();
        isContains(s1, s2);
    }

    private static void isContains (char[] s1, char[] s2) {
        int n1 = s1.length, n2 = s2.length;
        if (n1 == 0 || n1 < n2) {
            System.out.println("No");
            return;
        }
        Map<Character, Integer> hash = new HashMap<>();
        for (int i = 0; i < n1; i++) {
            hash.put(s1[i], hash.getOrDefault(s1[i], 0) + 1);
        }
        for (int i = 0; i < n2; i++) {
            if (!hash.containsKey(s2[i])) {
                System.out.println("No");
                return;
            } else {
                if (hash.get(s2[i]) == 0) {
                    System.out.println("No");
                    return;
                }
                hash.put(s2[i], hash.get(s2[i]) - 1);
            }
        }
        System.out.println("Yes");
    }
}
